Finding minimum type error sources

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding the sources of irradiance variation at sunspot minimum

In 2006-2007 the Solar Bolometric Imager (SBI) will operate in the polar stratosphere where near-space conditions can be attained for 10 to 30 days. The instrument will provide bolometric (wavelength-integrated light) and color temperature images of the Sun. At the upcoming sunspot minimum, SBI observations will be able to detect subtle sources of solar irradiance variation with the least confu...

متن کامل

The Ratio-type Estimators of Variance with Minimum Average Square Error

The ratio-type estimators have been introduced for estimating the mean and total population, but in recent years based on the ratio methods several estimators for population variance have been proposed. In this paper two families of estimators have been suggested and their approximation mean square error (MSE) have been developed. In addition, the efficiency of these variance estimators are com...

متن کامل

Finding minimum Tucker submatrices

A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in computational biology on the other hand they represents a class of convex bipartite graphs and are of interest of algorithm graph theory researchers. Tucker gave a forb...

متن کامل

Finding minimum clique capacity

Let C be a clique of a graph G. The capacity of C is defined to be (|V (G) \ C|+ |D|)/2, where D is the set of vertices in V (G) \C that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose as an open question in a study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no...

متن کامل

Minimum Distance Error Correction

A method is presented for incorporating error correction using a minimum distance measure into LR parsers. The method is suitable for use by an automatic parser-generator. State information in the LR parser stack at the point of detection of error is used to generate a set of strings which are potential repairs to the input. A string with least minimum distance from the actual input is chosen a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGPLAN Notices

سال: 2014

ISSN: 0362-1340,1558-1160

DOI: 10.1145/2714064.2660230